Computer and Modernization ›› 2011, Vol. 1 ›› Issue (1): 36-3.doi: 10.3969/j.issn.1006-2475.2011.01.010

• 算法分析与设计 • Previous Articles     Next Articles

Program Implementation and Analysis on an Improved Dijkstra Algorithm

HAO Chun-mei   

  1. Computer Science Department, Harbin University of Finance, Harbin 150030, China
  • Received:2010-10-08 Revised:1900-01-01 Online:2011-01-20 Published:2011-01-20

Abstract:

Dijkstra algorithm is an algorithm for solving singlesource shortestpaths of directed graph.This paper analyzes classical Dijkstra algorithm and puts forward an improved algorithm. By theoretical analysis, the improved algorithm can improve efficiency of directed sparse graph.

Key words: shortestpath, Dijkstra algorithm, improved algorithm